A parallel algorithm for constructing Voronoi diagrams based on point-set adaptive grouping
نویسندگان
چکیده
Jiangsu Provincial Key Laboratory of Geographic Information Science and Technology, Nanjing University, Nanjing, 210093, China Urban and Regional Research Centre Utrecht, Faculty of Geosciences, Utrecht University, Utrecht, 3584 CS, The Netherlands Geoinformatics, Royal Institute of Technology, 10044, Stockholm, Sweden State Key Laboratory of Resources and Environmental Information System, Institute of Geographic Sciences and Natural Resources Research, Beijing, 100101, China
منابع مشابه
Using the Voronoi Tessellation for Grouping Words and Multi-part Symbols in Documents
We examine the importance of the de nition of neighbors and neigh borhoods for grouping in document understanding and list some previous de nitions We present a number of bene ts to using the Voronoi neigh borhood de nition however we argue that de nitions based upon the point Voronoi diagrams are insu cient in the general case e g for group ing image elements in line drawings We give the de ni...
متن کاملConstructing higher-order Voronoi diagrams in parallel
We use Lee’s sequential algorithm [17] to create the first parallel algorithm which constructs the order-k Voronoi diagram of a planar point set. The algorithm is developed and analyzed within two parallel models, the fine-grained PRAM and the coarse-grained CGM. Its applications include k-nearest neighbor searches in a parallel context, which are important for many applications in computationa...
متن کاملThe geometry of circles: Voronoi diagrams, Möbius transformations, Convex Hulls, Fortune’s algorithm, the cut locus and parametrization of shapes
The geometry of circles in the plane is inextricably tied with the group of Möbius transformations, which take circles to circles. This geometry can be seen in a more symmetric after transforming the plane to the sphere, by stereographic projection. Interpretations will be discussed for Voronoi diagrams, Delaunay triangulations,etc. from this point of view. Fortune’s algorithm for constructing ...
متن کاملExact Construction of Minimum-Width Annulus of Disks in the Plane
The construction of a minimum-width annulus of a set of objects in the plane has useful applications in diverse fields, such as tolerancing metrology and facility location. We present a novel implementation of an algorithm for obtaining a minimum-width annulus containing a given set of disks in the plane, in case one exists. The algorithm extends previously known methods for constructing minimu...
متن کاملPolyline-sourced Geodesic Voronoi Diagrams on Triangle Meshes
This paper studies the Voronoi diagrams on 2-manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point-source based GVDs, since a typical bisector contains line segments, hyperbolic segments and paraboli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Concurrency and Computation: Practice and Experience
دوره 26 شماره
صفحات -
تاریخ انتشار 2014